Bounds-Consistent Local Search
نویسندگان
چکیده
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming which combines local search and bounds propagation, inspired by the success of a randomized algorithm for Boolean Satisfiability (SAT) called Unit-Walk. A dynamic prioritization heuristic has been developed to improve the algorithm, inspired by another algorithm called Squeaky Wheel Optimization.
منابع مشابه
Bounds on $m_r(2,29)$
An $(n, r)$-arc is a set of $n$ points of a projective plane such that some $r$, but no $r+1$ of them, are collinear. The maximum size of an $(n, r)$-arc in PG(2, q) is denoted by $m_r(2,q)$. In this paper thirteen new $(n, r)$-arc in PG(2,,29) and a table with the best known lower and upper bounds on $m_r(2,29)$ are presented. The results are obtained by non-exhaustive local computer search.
متن کاملStrong exponent bounds for the local Rankin-Selberg convolution
Let $F$ be a non-Archimedean locally compact field. Let $sigma$ and $tau$ be finite-dimensional representations of the Weil-Deligne group of $F$. We give strong upper and lower bounds for the Artin and Swan exponents of $sigmaotimestau$ in terms of those of $sigma$ and $tau$. We give a different lower bound in terms of $sigmaotimeschecksigma$ and $tauotimeschecktau$. Using the Langlands...
متن کاملUPPER BOUNDS FOR FINITENESS OF GENERALIZED LOCAL COHOMOLOGY MODULES
Let $R$ be a commutative Noetherian ring with non-zero identity and $fa$ an ideal of $R$. Let $M$ be a finite $R$--module of finite projective dimension and $N$ an arbitrary finite $R$--module. We characterize the membership of the generalized local cohomology modules $lc^{i}_{fa}(M,N)$ in certain Serre subcategories of the category of modules from upper bounds. We define and study the properti...
متن کاملAsynchronous Forward Bounding for Distributed COPs
A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and compute bounds on partial assignments asynchronously. The asynchronous bounds computation is based on the propagation of partial assignments. The asynchronous forward-bounding algorithm (AFB) is a distributed optimization search algorithm that keeps on...
متن کاملSolving the flexible job shop problem by hybrid metaheuristics-based multiagent model
The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...
متن کامل